A Unified Completeness Theorem for Quantified Modal Logics

نویسنده

  • Giovanna Corsi
چکیده

A general strategy for proving completeness theorems for quantified modal logics is provided. Starting from free quantified modal logic K, with or without identity, extensions obtained either by adding the principle of universal instantiation or the converse of the Barcan formula or the Barcan formula are considered and proved complete in a uniform way. Completeness theorems are also shown for systems with the extended Barcan rule as well as for some quantified extensions of the modal logic B. The incompleteness of Q◦.B+BF is also proved. In this paper we consider all free and classical quantified extensions of the propositional modal logic K obtained by adding either the axioms of identity or the Converse of the Barcan Formula or the Barcan Formula or the Extended Barcan Rule. Quantified extensions of the propositional logic B are also examined. The lack of “... a common completeness proof that can cover constant domains, varying domains, and models meeting other conditions...” has often been felt, see [3], p.132. In [4] and [5], p.273, we read “Ideally, we would like to find a completely general completeness proof.” The production of such a proof is the aim of this paper. We proceed by presenting a completeness proof for the system Q◦.K, Kripke’s original one with the addition of individual constants, we then show that such a proof yields completeness results for extensions of Q◦.K such as those characterized by models with increasing or constant domains, with or without non-existing objects, with or without identity. Our main goal is to offer a clear framework in which each completeness result considered, old or new, will find its natural place. Sometimes we will follow through the proof of a known result just to show how it fits into our framework. In the first part of the paper we will deal with the systems mentioned in the diagram below: This paper was written in the Fall 2001 during my visit to the Institute of Logic, Language and Computation in Amsterdam. I am very grateful to Prof. Dick de Jongh who made my stay at ILLC profitable and enjoyable. His comments to the present paper have been most valuable. My thanks also to the Netherlands Institute for Advanced Study, NIAS, who provided me, even if indirectly, with a very pleasant place to live near the Wassenaarseslag. 1The first part of this paper was presented at the workshop “Methods for Modalities 2”, Amsterdam, 29-30 November 2001. 2See [7]. c © 0000, Association for Symbolic Logic 0022-4812/00/0000-0000/$00.00

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repairing the interpolation theorem in quantified modal logic

Quantified hybrid logic is quantified modal logic extended with apparatus for naming states and asserting that a formula is true at a named state While interpolation and Beth’s definability theorem fail in a number of well known quantified modal logics (for example in quantified modal K, T, D, S4, S4.3 and S5 with constant domains), their counterparts in quantified hybrid logic have these prope...

متن کامل

Quantified Multimodal Logics in Simple Type Theory

We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple experiments, using existing higher-order theorem provers, to demonstrate that the embedding allows automated proofs of statements in these logics, as well as meta pro...

متن کامل

The Semantics of Modal Predicate Logic I. Counterpart-Frames

We introduce a new semantics for modal predicate logic, with respect to which a rich class of first-order modal logics is complete, namely all normal first-order modal logics that are extensions of free quantified K. This logic is defined by combining positive free logic with equality PFL . = and the propositional modal logic K. We then uniformly construct—for each modal predicate logic L—a can...

متن کامل

Constant Domain QuantifiedModal Logics Without Boolean Negation

: This paper provides a sound and complete axiomatisation for constant domain modal logics without Boolean negation. This is a simpler case of the difficult problem of providing a sound and complete axiomatisation for constant-domain quantified relevant logics, which can be seen as a kind of modal logic with a twoplace modal operator, the relevant conditional. The completeness proof is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Log.

دوره 67  شماره 

صفحات  -

تاریخ انتشار 2002